Feedback vertex set - PDFSEARCH.IO - Document Search Engine

Feedback vertex set
Results: 43

#	Item
21	PDF Document Add to Reading List Source URL: www.informatik.hu-berlin.de Language: English Morphisms Computational complexity theory Parameterized complexity Graph isomorphism problem Graph isomorphism Minor Graph canonization Feedback vertex set Tree decomposition Graph theory Theoretical computer science Mathematics
22	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:28 NP-complete problems Vertex cover Approximation algorithm Cubic graph Feedback arc set Dominating set Graph theory Theoretical computer science Mathematics
23	Implicit Hitting Set Problems, Multi-Genome Alignment and Colorful Connected Subgraphs Richard M. Karp CPM New York, June, 2010 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:40 Combinatorics Matroid theory Combinatorial optimization Set cover problem Matroid Feedback vertex set Maximum cut Greedy algorithm Mathematics Theoretical computer science NP-complete problems
24	Lower bounds based on the Exponential Time Hypothesis Daniel Lokshtanov∗ Dániel Marx† Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2013-05-30 15:14:06 NP-complete problems Complexity classes Mathematical optimization Analysis of algorithms Parameterized complexity Exponential time hypothesis NP-complete Time complexity Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
25	Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender · Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:15 NP-complete problems Graph operations Analysis of algorithms Parameterized complexity Feedback vertex set Tree decomposition Vertex cover Dominating set Kernelization Graph theory Theoretical computer science Mathematics
26	Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´ Add to Reading List Source URL: www.akt.tu-berlin.de Language: English - Date: 2012-06-07 13:36:43 NP-complete problems Vertex cover Kernelization Feedback vertex set Clique Dominating set Tree decomposition Graph Vertex Graph theory Theoretical computer science Mathematics
27	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
28	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems
29	New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-08-07 06:26:48 NP-complete problems Parameterized complexity Kernelization Path decomposition Vertex cover Feedback vertex set Dominating set Tree decomposition Clique Graph theory Theoretical computer science Mathematics
30	Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:19:59 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Feedback vertex set Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics

UPDATE